Alon-Babai-Suzuki’s Conjecture Related to Binary Codes in Nonmodular Version
نویسندگان
چکیده
1 Department of Mathematics, Donga-A University, Pusan 604-714, South Korea 2 Division of General Edu.-Math., Kwangwoon University, Seoul 139-701, South Korea 3 Department of Mathematics and Computer Science, Konkook University, Chungju 139-701, South Korea 4 Department of Mathematics, Kyungpook National University, Taegu 702-701, South Korea 5 Department of Computer Science, Chungbuk National University, Cheongju 361-763, South Korea
منابع مشابه
The (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملGeneralized Alon--Boppana Theorems and Error-Correcting Codes
In this paper we describe several theorems that give lower bounds on the second eigenvalue of any quotient of a given size of a fixed graph, G. These theorems generalize Alon-Boppana type theorems, where G is a regular (infinite) tree. When G is a hypercube, our theorems give minimum distance upper bounds on linear binary codes of a given size and information rate. Our bounds at best equal the ...
متن کاملLecture 21
1 Overview In this lecture, we will • Wrap up Alon-Edmonds-Luby's graph theoretical codes: construction and analysis of distance • Introduce the interplay between codes and computational complexity: open problems and pseudorandomness 2 Alon-Edmonds-Luby The construction of the code depends on three main ingredients: • A binary code C 0 = [d, R 0 d, δ 0 d] 2 , where R 0 and δ 0 are our target ra...
متن کاملEvasive properties of sparse graphs and some linear equations in primes
We give an unconditional version of a conditional, on the Extended Riemann Hypothesis, result of L. Babai, A. Banerjee, R. Kulkarni and V. Naik (2010) on the evasiveness of sparse graphs.
متن کاملSimple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کامل